搜索资源列表
NQueens
- 这是一个八皇后问题的扩展，使用java实现，扩展到了多皇后，只要你输入皇后的个数，能给出所有的解。-This is an expansion of 8 Queen
NQueensBacktracking.java
- 解决n-queens using blind search-solving n-queens using blind search
Queens-java.tar
- A recursive implementation to solve the n-queens problem, in Java.
nqueensquestion
- 可以对n皇后问题进行全面的实现，求出n皇后有多少种解法-N queens problem can be to achieve a comprehensive, calculate how many kinds of solution n Queen
Queen
- 八皇后 进一步加深编程，进一步难度为N皇后问题-Eight Queens program to further deepen and further difficulty for the N queens problem
NQueen
- n-皇后问题的迭代回溯解法，里面是完整的程序。可以运行。本人亲写。-n-queens problem iterative back solution, which is a complete program. Can run. I am pro-write.
nQueen
- n Queens problem solution using backtracking programing
nqueensja
- n queens problem solved in java
queens
- 用回溯法实现N后问题，使用的是JAVA开发环境的说。-Backward Method N
NQueens
- 用回溯法求解N皇后问题，大家可以参考借鉴一下-With backtracking to solve N Queens problem, we can refer to learn about
NQueens
- 算法系列-N皇后问题的解决，用java语言来编写-Algorithms Series-N queens problem solve, to write java language
NqueensProblem
- 软件架构实例：使用分别使用管道-过滤器风格、调用/返回风格、回溯法和黑板风格四种架构风格实现N皇后问题；-Software architecture instance: use use the pipeline- filter style, call/return style N queens problem, backtracking and blackboard style four architectural styles
Queen
- 算法分析与设计 用回溯法实现n皇后问题(java源码)-Algorithm Analysis and Design N-queens Problem Using Backtracking
N--java-
- 利用递归机制，可以很容易的求解n皇后问题。针对八皇后，总共有92种解。下面将给出N-皇后问题的一般求解代码，在这里代码是使用java编码的。-Recursive mechanism that can easily solve the n-queens problem. For eight queens, a total of 92 kinds of solutions. The following will give a general N-queens problem solving code
Queen
- 采用拉斯维加斯算法和回溯法相结合，解决N皇后问题-Las Vegas using algorithms and backtracking Combination, N Queens problem solving
Queen
- 用java语言，基于回溯法实现N皇后的位置放置方案，程序可以通过参数来设置要解决几个皇后的放置，默认是4个。(Using java language, backtracking method is used to implement the placement plan of N queens. The program can be set by parameters to solve the placement of several queens, and the default is 4.)